Weak Arithmetics and Kripke Models
نویسنده
چکیده
In the first section of this paper we show that iΠ1 ≡ W¬¬lΠ1. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Πm-formulas in a linear Kripke model deciding ∆0-formulas, it is necessary and sufficient that the model be Σm-elementary. This implies that if a linear Kripke model forces PEMprenex, then it forces PEM . We also show that, for each n > 1, iΦn does not prove H(IΠn). Here, Φn’s are Burr’s fragments of HA. 2000 Mathematics Subject Classification: 03F30, 03F55, 03H15.
منابع مشابه
Corrigendum to "Weak Arithmetics and Kripke Models"
We give a corrected proof of the main result in the paper mentioned in the title. 2000 Mathematics Subject Classification: 03F30, 03F55, 03H15.
متن کاملIndependence results for weak systems of intuitionistic arithmetic
This paper proves some independence results for weak fragments of Heyting arithmetic by using Kripke models. We present a necessary condition for linear Kripke models of arithmetical theories which are closed under the negative translation and use it to show that the union of the worlds in any linear Kripke model of HA satisfies PA. We construct a two-node PA-normal Kripke structure which does ...
متن کاملRudimentary Beth Models and Conditionally Rudimentary Kripke Models for the Heyting Propositional Calculus
This paper continues the investigation of rudimentary Kripke models, i.e. non-quasiordered Kripke-style models for the Heyting propositional calculus H. Three topics, which make three companion pieces of [3], are pursued. The first topic is Beth-style models for H called rudimentary Beth models. Rudimentary Kripke models may be conceived as a particular type of these models, which are analogous...
متن کاملThe Arithmetics of a Theory
In this paper we study the interpretations of a weak arithmetic, like Buss’ theory S2, in a given theory U . We call these interpretations the arithmetics of U . We develop the basics of the structure of the arithmetics of U . We study the provability logic(s) of U from the standpoint of the framework of the arithmetics of U . Finally, we provide a deeper study of the arithmetics of a finitely ...
متن کاملA Canonical Model Construction for Substructural Logics
In this paper, we introduce a class of substructural logics, called normal substructural logics, which includes not only relevant logic, BCK logic, linear logic and the Lambek calculus but also weak logics with strict implication, and de ne Kripkestyle semantics (Kripke frames and models) for normal substructural logics. Then we show a correspondence between axioms and properties on frames, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 48 شماره
صفحات -
تاریخ انتشار 2002